package EnterpriseAlgorithm.Stack_Queue.Code.SlidingWindowMaximum;

public class Example {
    public static void main(String[] args) {
        int[] nums = {1,3,-1,-3,5,3,6,7};
        int k = 3;
        Solution1 solution1 = new Solution1();
        int[] res = solution1.maxSlidingWindow(nums, k);
        for (int i : res) {
            System.out.print(i + " ");
        }
        System.out.println("\n" +"=========================");
        Solution2 solution2 = new Solution2();
        int[] res2 = solution2.maxSlidingWindow(nums, k);
        for (int i : res2) {
            System.out.print(i + " ");
        }
        System.out.println("\n" +"=========================");
        Solution2_ii solution3 = new Solution2_ii();
        int[] res3 = solution3.maxSlidingWindow(nums, k);
        for (int i : res3) {
            System.out.print(i + " ");
        }
    }
}
